In-Medium Similarity Renormalization Group for Nuclei

We present a new ab-initio method that uses similarity renormalization group (SRG) techniques to continuously diagonalize nuclear many-body Hamiltonians. In contrast with applications of the SRG to two- and three-nucleon interactions in free space, we perform the SRG evolution "in medium" directly in the $A$-body system of interest. The in-medium approach has the advantage that one can approximately evolve $3,...,A$-body operators using only two-body machinery based on normal-ordering techniques. The method is nonperturbative and can be tailored to problems ranging from the diagonalization of closed-shell nuclei to the construction of effective valence shell-model Hamiltonians and operators. We present first results for the ground-state energies of $^4$He, $^{16}$O and $^{40}$Ca, which have accuracies comparable to coupled-cluster calculations.Comment: 4pages, 4 figures, to be published in PR

Discovering Restricted Regular Expressions with Interleaving

Discovering a concise schema from given XML documents is an important problem in XML applications. In this paper, we focus on the problem of learning an unordered schema from a given set of XML examples, which is actually a problem of learning a restricted regular expression with interleaving using positive example strings. Schemas with interleaving could present meaningful knowledge that cannot be disclosed by previous inference techniques. Moreover, inference of the minimal schema with interleaving is challenging. The problem of finding a minimal schema with interleaving is shown to be NP-hard. Therefore, we develop an approximation algorithm and a heuristic solution to tackle the problem using techniques different from known inference algorithms. We do experiments on real-world data sets to demonstrate the effectiveness of our approaches. Our heuristic algorithm is shown to produce results that are very close to optimal.Comment: 12 page

Maximal induced matchings in triangle-free graphs

An induced matching in a graph is a set of edges whose endpoints induce a $1$-regular subgraph. It is known that any $n$-vertex graph has at most $10^{n/5} \approx 1.5849^n$ maximal induced matchings, and this bound is best possible. We prove that any $n$-vertex triangle-free graph has at most $3^{n/3} \approx 1.4423^n$ maximal induced matchings, and this bound is attained by any disjoint union of copies of the complete bipartite graph $K_{3,3}$. Our result implies that all maximal induced matchings in an $n$-vertex triangle-free graph can be listed in time $O(1.4423^n)$, yielding the fastest known algorithm for finding a maximum induced matching in a triangle-free graph.Comment: 17 page

Mod/Resc Parsimony Inference

We address in this paper a new computational biology problem that aims at understanding a mechanism that could potentially be used to genetically manipulate natural insect populations infected by inherited, intra-cellular parasitic bacteria. In this problem, that we denote by \textsc{Mod/Resc Parsimony Inference}, we are given a boolean matrix and the goal is to find two other boolean matrices with a minimum number of columns such that an appropriately defined operation on these matrices gives back the input. We show that this is formally equivalent to the \textsc{Bipartite Biclique Edge Cover} problem and derive some complexity results for our problem using this equivalence. We provide a new, fixed-parameter tractability approach for solving both that slightly improves upon a previously published algorithm for the \textsc{Bipartite Biclique Edge Cover}. Finally, we present experimental results where we applied some of our techniques to a real-life data set.Comment: 11 pages, 3 figure

Analytical thermal modeling and calibration method for lithium-ion batteries

The lithium-ion battery is an essential component to drive mobile systems. The battery behavior varies depending on its thermal conditions. Thus, to optimize the lifetime performance, it is important to estimate the inner temperatures of battery. This paper proposes a new analytical method to estimate the inner temperatures of battery with the use of the Joule heat as well as the Entropy heat. An evaluation is also attempted by means of a real battery sample.Papers presented at the 13th International Conference on Heat Transfer, Fluid Mechanics and Thermodynamics, Portoroz, Slovenia on 17-19 July 2017 .International centre for heat and mass transfer.American society of thermal and fluids engineers

Chiral three-nucleon forces and bound excited states in neutron-rich oxygen isotopes

We study the spectra of neutron-rich oxygen isotopes based on chiral two- and three-nucleon interactions. First, we benchmark our many-body approach by comparing ground-state energies to coupled-cluster results for the same two-nucleon interaction, with overall good agreement. We then calculate bound excited states in 21,22,23O, focusing on the role of three-nucleon forces, in the standard sd shell and an extended sdf7/2p3/2 valence space. Chiral three-nucleon forces provide important one- and two-body contributions between valence neutrons. We find that both these contributions and an extended valence space are necessary to reproduce key signatures of novel shell evolution, such as the N = 14 magic number and the low-lying states in 21O and 23O, which are too compressed with two-nucleon interactions only. For the extended space calculations, this presents first work based on nuclear forces without adjustments. Future work is needed and open questions are discussed.Comment: 6 pages, 4 figures, published versio

Reconfiguration of Cliques in a Graph

We study reconfiguration problems for cliques in a graph, which determine whether there exists a sequence of cliques that transforms a given clique into another one in a step-by-step fashion. As one step of a transformation, we consider three different types of rules, which are defined and studied in reconfiguration problems for independent sets. We first prove that all the three rules are equivalent in cliques. We then show that the problems are PSPACE-complete for perfect graphs, while we give polynomial-time algorithms for several classes of graphs, such as even-hole-free graphs and cographs. In particular, the shortest variant, which computes the shortest length of a desired sequence, can be solved in polynomial time for chordal graphs, bipartite graphs, planar graphs, and bounded treewidth graphs